Point Multiplication on Supersingular Elliptic Curves Defined over Fields of Characteristic 2 and 3
نویسندگان
چکیده
Elliptic curve cryptosystem protocols use two main operations, the scalar multiplication and the pairing computation. Both of them are done through a chain of basic operation on the curve. In this paper we present new formulas for supersingular elliptic curve in characteristic 2 and 3. We improve best known formulas by at least one multiplication in the field.
منابع مشابه
A Note on Point Multiplication on Supersingular Elliptic Curves over Ternary Fields
Recently, the supersingular elliptic curves over ternary fields are widely used in pairing based crypto-applications since they achieve the best possible ratio between security level and space requirement. We propose new algorithms for projective arithmetic on the curves, where the point tripling is field multiplication free, and point addition and point doubling requires one field multiplicati...
متن کاملScalar Multiplication on Pairing Friendly Elliptic Curves
Efficient computation of elliptic curve scalar multiplication has been a significant problem since Koblitz [13] and Miller [14] independently proposed elliptic curve cryptography, and several efficient methods of scalar multiplication have been proposed (e.g., [8], [9], [12]). A standard approach for computing scalar multiplication is to use the Frobenius endomorphism. If we compute the s-multi...
متن کاملComputation of Tate Pairing for Supersingular Curves over characteristic 5 and 7
We compute Tate pairing over supersingular elliptic curves via the generic BGhES[3] method for p = 5, 7. In those cases, the point multiplication by p is efficiently computed by the Frobenius endomorphism. The function in a cycle can be efficiently computed by the method of continued fraction.
متن کاملCM-Curves with Good Cryptographic Properties
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosystems: (1) they are nonsupersingular (so that one cannot use the Menezes-Okamoto-Vanstone reduction of discrete log from elliptic curves to finite fields); (2) the order of the group h a s a large prime factor (so that ...
متن کاملSoftware Implementation of Arithmetic in F3m
Fast arithmetic for characteristic three finite fields F3m is desirable in pairing-based cryptography because there is a suitable family of elliptic curves over F3m having embedding degree 6. In this paper we present some structure results for Gaussian normal bases of F3m , and use the results to devise faster multiplication algorithms. We carefully compare multiplication in F3m using polynomia...
متن کامل